Heuristic and metaheuristic methods for computing graph treewidth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic and metaheuristic methods for computing graph treewidth

The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many ...

متن کامل

Computing Graph Distances Parameterized by Treewidth and Diameter

We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed in time n expO(k log d), where k is the treewidth of the graph and d is the diameter. This means that the diameter and the radius of the graph can be computed in the same time. In particular, if the diameter is constant, it can be determined in time n expO(k). This result matches a recent hardness...

متن کامل

Treewidth and graph minors

We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph problem has a polynomial time algorithm (though the algorithms that come out of the theory are often not practical). We shall review a small part of this theory, and illustrate how dynamic programming can be used to solve some NP-hard problems on restricted cla...

متن کامل

Appropriating Heuristic Evaluation Methods for Mobile Computing

abstract Heuristic evaluation has proven popular for desktop and Web interfaces, both in practical design and as a research topic. Compared to full user studies, heuristic evaluation can be highly cost-effective, allowing a large proportion of usability flaws to be detected ahead of full development with limited resource investment. Mobile computing shares many usability issues with more conven...

متن کامل

Exact, Heuristic and Metaheuristic Methods for Confidentiality Protection by Controlled Tabular Adjustment

Government agencies and commercial organizations that report data face the task of representing the data meaningfully while simultaneously protecting the confidentiality of critical data components. The challenge is to organize and disseminate data in a form that prevents these components from being unmasked by corporate espionage, or falling prey to efforts to penetrate the security of the inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Operations Research

سال: 2004

ISSN: 0399-0559,1290-3868

DOI: 10.1051/ro:2004011